Internet of Things Search and Discovery Using Graph Engine

ABSTRACT

In an example, a graph structure and flat data corresponding to the graph structure are obtained, the graph structure containing a plurality of nodes. Stop words are removed from one or more search terms to obtain modified search terms. For each of the modified search terms, the pieces of data from the flat data are searched to locate one or more matching pieces of data from the flat data, wherein a piece of data from the flat data matches if it contains at least one attribute with a value that is similar to the modified search term. This information is used to calculate fuzzy match scores for each matching piece of data from the flat data.

CROSS-RELATION TO RELATED APPLICATIONS

This application claims priority to U.S. Provisional Application No.62/586,287, filed Nov. 15, 2017, entitled “INTERNET OF THINGS SEARCH ANDDISCOVERY,” hereby incorporated herein by reference in its entirety.

TECHNICAL FIELD

This document generally relates to systems and methods for Internet ofThings (IoT) data management. More specifically, this document relatesto search and discovery of IoT data using a graph engine.

BACKGROUND

The IoT is a network of physical devices, vehicles, and other itemsembedded with electronics, software, sensors, actuators and/or networkconnectivity, which enables these objects to collect and exchange data.“Things” refers to any sort of object that can product and exchangeinformation. Common examples are home appliances, business andmanufacturing equipment, wearable devices, and the like. It is expectedthat the number and type of things that can be connected via the IoTwill increase exponentially in the next decade.

The result of this rapid expansion of IoT is a technical difficulty inmanaging the data produced by the things in an IoT network. Sensor data,for example, can be gathered multiple times per second on just a singledevice, leading to a significant amount of data to maintain and sorteven for a single device, let alone the millions or billions expected tobe IoT-capable in the coming years.

There are also many different types of data that are relevant in an IoTnetwork. Sensor data is only one of these types of data, but the datacould also include, for example, equipment identifications, modelinformation, model instances, etc. Focusing indexing and searching ofIoT data on individual types of data may be too limiting because usersmay not know the type of data they are looking for. For example, a usermay be interested in obtaining a manual for a piece of equipment, andthey may know the manufacturer but not the model name, and yet themanual may be stored only in a model instance identified by the modelname. Searching on manufacturer data only will not find a manual becausethe manual is not stored in the manufacturer data, but searching onmodel instances alone will not find the manual because the manufacturername is not found in the model instance data. What is needed aremechanisms allowing for indexing and searching across data types in anIoT network.

BRIEF DESCRIPTION OF DRAWINGS

The present disclosure is illustrated by way of example and notlimitation in the figures of the accompanying drawings, in which likereferences indicate similar elements.

FIG. 1 is a block diagram illustrating a system for IoT data managementin accordance with an example embodiment.

FIG. 2 is a block diagram illustrating the data aggregation component ofFIG. 1 in more detail, in accordance with an example embodiment.

FIG. 3 is a diagram illustrating flat data stored in a flat data store.

FIG. 4 is a block diagram illustrating an example of a graph structurein accordance with an example embodiment.

FIG. 5 is a flow diagram illustrating a method for indexing data inaccordance with an example embodiment.

FIG. 6 is a screen capture illustrating a user interface for validationof linkages between pieces of flat data in accordance with an exampleembodiment.

FIG. 7 is a block diagram illustrating a search engine back-end in moredetail, in accordance with an example embodiment.

FIG. 8 is a flow diagram illustrating a method for searching data in adatabase in accordance with an example embodiment.

FIG. 9 is a screen capture illustrating a user interface for searchqueries and results in accordance with an example embodiment.

FIG. 10 is a screen capture illustrating another search entered into theuser interface for search queries and results in accordance with anexample embodiment.

FIG. 11 is a flow diagram illustrating a method for context-basedranking of search results in accordance with an example embodiment.

FIG. 12 is a flow diagram illustrating a method for history-basedranking of search results in accordance with an example embodiment.

FIG. 13 is a flow diagram illustrating a method for dynamic rendering ofsearch results, in accordance with an example embodiment.

FIG. 14 is a block diagram illustrating a Structured Query Language(SQL) command former, in accordance with an example embodiment.

FIG. 15 is a flow diagram illustrating a method of forming a SQL queryfrom a freeform search query in accordance with an example embodiment.

FIG. 16 is a block diagram illustrating an architecture of software,which can be installed on any one or more of the devices describedabove.

FIG. 17 illustrates a diagrammatic representation of a machine in theform of a computer system within which a set of instructions may beexecuted for causing the machine to perform any one or more of themethodologies discussed herein, according to an example embodiment.

DETAILED DESCRIPTION

The description that follows discusses illustrative systems, methods,techniques, instruction sequences, and computing machine programproducts. In the following description, for purposes of explanation,numerous specific details are set forth in order to provide anunderstanding of various example embodiments of the present subjectmatter. It will be evident, however, to those skilled in the art, thatvarious example embodiments of the present subject matter may bepracticed without these specific details.

In an example embodiment, a search engine that is capable ofsimultaneously and efficiently searching and retrieving multiple typesof data in an IoT network is provided. The search engine allows forhandling of freeform queries to return more relevant results than priorsearch engines, from data such as master data, sensor data, andmetadata. Additionally, the search engine capabilities can be extendedto other types of activities on the IoT data, including deletion,creation, and update, all within a single interface. Furthermore, thesearch engine capabilities are contextual, conversational, andanalytical.

FIG. 1 is a block diagram illustrating a system 100 for IoT datamanagement in accordance with an example embodiment. Here, the system100 may include a data aggregation component 102 that aggregates datafrom a plurality of IoT networks 104, 106, 108. Each IoT network 104,106, 108 may be operated by a different customer of the system 100. EachIoT network 104, 106, 108 comprises an IoT platform 110 and a pluralityof IoT devices 112. Each IoT network 104, 106, 108 may also include adata processing module 114 that collects information from the IoTdevices 112 (as well as other data related to the IoT devices 112).Examples of data processing modules 114 may include streaming datacollectors such as event stream processing (ESP) applications andrelational database collectors such as SQL Anywhere ConnectorTM fromSAP, SE of Walldorf, Germany.

Data gathered by the data aggregation component 102 may be stored in adatabase 116. In some example embodiments, the database 116 may be anin-memory database, such as HANA™ from SAP, SE of Walldorf, Germany.

A search engine back end 118 obtains data from the database 116 inresponse to queries received by a search engine front-end 120 in a userinterface 122 on user device 124. In some example embodiments, the userinterface 122 may be a web browser and the search engine front-end 120may be a web page executing in the web browser. In other exampleembodiments, the user interface 122 may be part of a stand-aloneapplication on user device 124.

One technical challenge that is encountered with providing efficient andreliable search results in an IoT network is how to handle the plethoraof different types of data that are encountered. Another technicalchallenge is the sheer volume of data, especially from such data typesas sensor data. There may be many different types of sensors, some ofwhich may be capable of continuous data collection (for example,temperature sensors, which can be capturing temperature readings at anynumber of intervals specified by a user).

In some example embodiments, the sensor data, as well as otherIoT-related data, may be initially indexed into a flat data store asflat data. This flat data is then augmented with metadata and themetadata. This metadata may then be used to identify linkages betweenpieces of data and these linkages can then be used to create a graphstructure. As will be seen in more detail later, the graph structureallows data from various types of IoT sources to be stored efficientlywhile permitting freeform searches on the data to be efficient as well.

FIG. 2 is a block diagram illustrating the data aggregation component102 of FIG. 1 in more detail, in accordance with an example embodiment.In an example embodiment, the IoT data is initially stored in arelational database as a plurality of relational tables. In order tocreate the indexed flat data, these relational tables need to beflattened. As such, a data flattener 200 may be provided to perform thisflattening aspect. In an example embodiment, the relational tables areflattened by identifying unique paths through the relational tables andretrieving data from the tables in each path to form a record. It shouldbe noted that relational tables are only one example of a format ofdatabase file that may be flattened. In practice, any type of databaseformat may be flattened through various techniques that are beyond thescope of this disclosure.

The record for each path may then be augmented with metadata by a flatdata augmentation component 202. This metadata may include a type namefor the data in the record and an attribute name for each attribute ofthe record. The metadata may then be used to identify linkages betweenrecords.

While in a perfect world each underlying piece of data would explicitlyidentify each other related piece of data in the flat data (which wouldallow the graph structure to be constructed by creating edges for eachof these explicit relations), in the IoT world it is rare if not unheardof for such identifications to be made explicitly. For one thing, mostIoT equipment is simply not set up to track data type interactions inthis way. For example, a piece of equipment may have an ability to markthe locations where the equipment resides, but it has no way to knowthat there is a location data type for each of these locations thatitself might have its own attributes. As such, in an example embodiment,a linkage inference engine 204 is used to make inferences as torelationships between nodes.

The linkage inference engine 204 operates by scanning attributes ofvarious pieces of data in the flat data store and identifying pieces ofdata that contain subsets of attributes of one another. Any piece ofdata that contains a subset of attributes of any other piece of data canbe considered as having a potential linkage to that other piece of data.

In many Enterprise Resource Planning (ERP) systems, each ID assigned toan attribute is globally unique. This is known as a “Globally UniqueIdentifier” (GUID). Thus, the same ID is not repeated twice (e.g., if“1” is assigned to a particular location, then “1” will not be assignedto any other locations and also will not be assigned to any other typeof ID, such as user ID, equipment ID, etc., in the system).

In some example embodiments, GUIDs may be assigned when the originaldata, such as relational data, is flattened into flat data format. Forexample, as described above, relational tables may be flattened byidentifying unique paths through the relational tables. Each of theseunique paths may be assigned a GUID.

The linkage inference engine 204 can also infer the types of individualpieces of data. For example, it can infer that the number 10 is ameasurement and the string “7/15/15” is a date. This interference isbased on the data itself and corresponding relationships with otherpieces of data in the flat data. Thus, this inference may be“customer-centric” in that the inference (and the inference's subsequentacceptance by the customer) may vary from customer to customer.

The inferred linkages between pieces of flat data can then be used by agraph engine 206 to generate a graph structure. The graph structurecontains nodes corresponding to pieces of flat data and edgescorresponding to the linkages. This will be described in more detailbelow.

FIG. 3 is a diagram illustrating flat data 300 stored in a flat datastore. When data is indexed in the flat data store, each piece of datamay be stored in a record 302A-302D. Each record may have one or morepieces of data, and it is not necessary that each type of data only havea single record. Here, for example, record 302A contains data of theEquipment data type, and it contains two pieces of data 304A, 304B ofthat Equipment data type. Likewise, record 302B contains two pieces ofdata 304C, 304D of the Model data type. Record 302C contains a singlepiece of data 304E of the Equipment data type. Record 302D containsthree pieces of data 304F, 304G, 304H of the Location data type. Itshould be noted that while the pieces of data 304A-304H are depicted inthis figure as text, in many example embodiments the pieces of data304A-304H may be stored as tables, with each column in the tablecorresponding to a different attribute type and each row in the tablecorresponding to a different instance of information. Thus, for example,piece of data 304A may be stored as a table with columns “name”,“class”, “color” and “location ID”, and there may be two rows, onecorresponding to “MobileEquip” “Pumps” “Red” “1” and one correspondingto MobileEquip” “Pumps” “Red” “2.”

Since there are many different potential types of data that may bestored in the flat data store, there are a large number of differentpotential attributes for the data. Indeed, the flexibility to createattributes is so great that it is common for attributes of differenttypes of data to actually be the same attribute but be named orformatted in a such a way that does not make explicit that the attributeis the same. For example, in FIG. 3, record 302D has piece of data 304F,which corresponds to the location “Coburg.” It has attributes such as“Name” 306A (Coburg) and “ ID” 306B (1). Record 302A has piece of data304A, which corresponds to the equipment brand “MobileEquip” and hasattributes such as “Name” 308A (MobileEquip), “Class” 308B (Pumps),“Color” attribute 308C (Red) and “Location ID” attribute 308D (1 and 2).Notably, the Location ID attribute 308D for location 1 corresponds tothe same data as, for example, the ID attribute 310A of piece of data304F in record 302D, and yet they are named differently. There isnothing in the data explicitly linking Location ID attribute 308D ofpiece of data 304A to the Location ID attribute 308D of piece of data304F.

As such, in an example embodiment, the linkage inference engine 204scans the attributes of the various pieces of data to locate attributesthat contain values that are a subset of the value of other attributes.

Identifying the linkage in systems where the IDs are not unique is morechallenging. In some example embodiments, the linkage inference engine204 may further improve the proposed linkages between attributes in suchcases by examining the names of the attributes and seeing if there areattributes sharing the names, prior to looking for matching subsets ofvalues of attributes. For example, the linkage inference engine 204 mayfirst notice that the attribute name “location ID” of piece of data 304Acontains one part (“location”) that is a value of the data typeattribute 308D of piece of data 304F. This is a strong indicator thatpiece of data 304F may contain a linkage and thus it may then look toidentify, in record 302A, subsets of values from attributes of record302D, as described above.

Matching of the subsets may be performed in a number of different ways.In an example embodiment, a subset is defined in the linkage inferenceengine 204 as a first set of values of attributes in a first record,where all of the values in the first set are contained within a secondset of values of attributes from a different record. The linkageinference engine 204 then compares all potential sets in the flat datastore in order to identify these subsets.

It should be noted that in some environments where the number ofpotential sets is quite large, the above process may be very time- andprocessor-intensive. As such, in an example embodiment, a modificationis provided using a dictionary table 208. When each record 202A-202D andall its attributes are indexed, the attributes are put in the dictionarytable 208 by a dictionary table component 210. The dictionary table 208is based on hashed values by hashing each of the attributeidentifications and values after they have been sorted. The dictionarytable 208 is designed in a way such that all the sorted unique IDs arehashed, and these IDs are linked to their sources in the flat data. Thedictionary table 208 is indexed by the data type and the attributenames. When the linkage process is initiated, it may then be performedon the dictionary table 208 instead of the flat data itself. So, forexample, the dictionary table 208 may have a first column for a datatype such as equipment, a second column for an attribute name such aslocation ID, and a third column for the actual values of the attribute,which are unique and sorted and have a hash code.

Once the linkage inference engine 204 completes its inferences, one ormore of these inferences may be presented to a customer for validationby a validation module 212. Thus, for example, the customer may bepresented with the inference that Coburg is a location that matches oneof the locations of the equipment MobileEquip. If the customer validatesthis linkage, such as by saying “yes” to a question posed as to whetherthe linkage is valid, then the linkage may be used when creating thegraph structure.

The graph structure may then be formed by the graph engine 206 bycreating a node for each instance of a piece of data, with each nodehaving a type associated with the data type of the underlying data.Linked pieces of data can be represented by edges between nodes. Asdescribed above, each piece of data may in actuality be a record thatcould contain multiple rows, one for each instance. As such, thecreation of the graph structure may include creating a node for each rowof each piece of data in the flat data.

FIG. 4 is a block diagram illustrating an example of a graph structure400 in accordance with an example embodiment. Each piece of data,whether it be sensor data, master data, or metadata, is stored as anode, such as nodes 402A-402H. Each node 402A-402H may contain anidentification of the underlying data. In some example embodiments, eachnode 402A-402H contains the data itself, but in some exampleembodiments, each node 402A-402G identifies the data that is stored inthe flat data store, without actually storing the underlying data.

Each node 402A-402H may have a data type. Here, the different data typesare identified by different colors depicted for the nodes of thedifferent data types, but at the database level the different nodes mayeach contain a data type attribute that identifies the data type of theunderlying node. Here, for example, there are nodes having a sensor datatype, an equipment data type, a location data type, and a model datatype.

Each node 402A-402H may be linked to any other node 402A-402H via anedge, such as edges 404A-404H. An edge 404A-404H exists between twonodes when there is a linkage between the underlying pieces of data.

FIG. 5 is a flow diagram illustrating a method 500 for indexing data inaccordance with an example embodiment. At operation 502, data in anon-flat format, and metadata corresponding to the data, are obtainedfrom a first database. At operation 504, the data is flattened into flatdata. At operation 506, the flat data is augmented with the metadata.The metadata includes attribute names and values for attributescorresponding to the attribute names. At operation 508, a dictionarytable is created with data types on one axis and attribute names onanother axis, with table entries having hashed values for correspondingcombinations of data types and attribute names.

At operation 510, one or more pieces of the flat data are scanned tolocate a first piece of flat data having a first attribute withattribute values that are a subset of attribute values of a secondattribute of a second piece of flat data. At operation 512, a link iscreated between the first attribute of the first piece of flat data andthe second attribute of the second piece of flat data. At operation 514,the link between the first attribute of the first piece of flat data andthe second attribute of the second piece of flat data is sent to a userinterface on a user device for display. At operation 516, a validationof the link is received from the user interface. At operation 518, agraph structure is generated. The graph structure contains a pluralityof nodes, each node corresponding to a data type of the flat data andcorresponding to one or more pieces of data in the flat data of thecorresponding data type, the graph structure further containing aplurality of edges connecting one or more of the plurality of nodes,each edge corresponding to a link between an attribute of a node at oneside of the edge and an attribute of a node at another side of the edge.At operation 520, the flat data and the graph structure are stored in asecond database.

FIG. 6 is a screen capture illustrating a user interface for validationof linkages between pieces of flat data in accordance with an exampleembodiment. As indicated earlier, the validation module 212 may ask oneor more users to validate linkages proposed by the linkage interfaceengine 214. This may be accomplished by sending proposed linkages touser interface 122 on user device 124 (FIG. 1). It should be noted thatit is not necessary that the same user device 124 be used for thisvalidation as will subsequently be used to obtain search queries anddisplay search results.

In FIG. 6, there is an indication of a matched attribute 600 and anindication of the proposed linked type 602, in the form of a drop-downmenu that the user can alter to change the linkage or delete thelinkage.

Once the graph structure 400 has been formed, it may then be stored inthe database 116 along with the flat data 300. In an example embodiment,both the flat data 300 and the graph structure 400 are used to performfreeform searches on data. Specifically, one of the technical issuesassociated with the variety of different IoT data types that can bestored is that users may find it difficult to identify relevant data,especially when not knowing exactly what to search for. For example, auser may wish to locate a user manual for a particular piece ofequipment, but the user may be the user of the exact model number of theequipment. The user manual may be stored in a “model” data type, but theuser may only know the brand (e.g., MobileEquip) and general type (e.g.,pumps) of the equipment. A search on either MobileEquip or pump oneither the flat data 300 or the original relational database willproduce results, but none of those results will actually contain theuser manual sought. Additional issues that may occur are misspellings orsynonyms in the indexed data that are not found in the search query, orvice versa. What is needed is a technical solution that allows forfreeform searching to be performed in an efficient and effective manner.

Referring back to FIG. 1, the search engine front-end 120 may obtain,via the user interface 122 on user device 124, a search query, from auser of the user device 124. In one example embodiment, this may beperformed by presenting a text box in the user interface 122 where theuser can type the search query. The search engine front-end may thenforward the search query to the search engine back-end 118.

FIG. 7 is a block diagram illustrating a search engine back-end 118 inmore detail, in accordance with an example embodiment. The search engineback-end 118 may include a match locator 700. In an example embodiment,the match locator 700 first searches the flat data 300 (or alternativelythe dictionary table 208) to identify matches to terms in the underlyingdata. The matches may appear in any of the attributes of the flat data300.

It should be noted that in some example embodiments, the flat data 300contains the aforementioned augmented metadata. It should also be notedthat these matches need not be exact. Rather, a fuzzy match score may beassigned to each attribute, and if the fuzzy match score exceeds apredetermined threshold, then the piece of data having the attribute maybe considered a match. Thus, for example, if the search contained theterm “MobileEquip,” then a piece of data having an attribute “name” of“MobileEquip” would be an exact match, but a piece of data having anattribute “name” of “MobileEquip” may also be considered a match, albeitwith a lower fuzzy match score. A piece of data having an attribute“name” of “MobleEquips” may also be considered a match with a lowerfuzzy match score, but a piece of data having an attribute “name” of“Mob” may be considered to be too far from the exact match to beconsidered a match, due to having a fuzzy match score below apredetermined threshold.

In some example embodiments, the piece of data having an attribute“name” of “Mob” may be assigned a fuzzy match score and then that fuzzymatch score determined not to meet a threshold score. In one exampleembodiments, the matching algorithm is advanced enough to know that thename “Mob” is simply too far from the query term “MobileEquip” and thusno fuzzy match score need to be assigned. In such cases the fuzzy matchscore may only be calculated for pieces of data that are somewhat closeto the original search term in the query.

Dictionaries and synonyms could also be used at this point to helpidentify alternative spellings of terms and synonyms of words thatshould be considered identical.

Nevertheless, the result of these operations is that matching pieces ofdata (those that have fuzzy match scores exceeding a first threshold)will be assigned their respective fuzzy match scores, but non-matchingpieces of data will be assigned a fuzzy match score of 0. In someexample embodiments, these fuzzy match scores may be based on editdistance, and the threshold may indicate a threshold edit distance.

There may be cases where multiple attributes of the piece of data matchsearch terms. For example, if the search query was “EquipmentMobileEquip in Coburg,” then a piece of data having a data typeattribute of “Equipment” and a name attribute of “MobileEquip” wouldmatch on both of these attributes. In such cases, each match can beassigned its own fuzzy match score, and the fact that multiple matcheswere found could enhance the ranking of the piece of data in theresults, as will be seen below.

Specifically, a match frequency score can also be assigned to each pieceof data that has a match. The match frequency score represents or isproportional to the number of matching attributes in the piece of data.Thus, for example, the piece of data having a data type attribute of“Equipment” and a name attribute of “MobileEquip” might have a matchfrequency score of 2 whereas a piece of data having the data typeattribute of “Location” and a name attribute of “Coburg” might have amatch frequency score of 1. This provides relevance to the user typingin aspects of the desired results that aren't necessarily the aspects ofthe data value itself. Specifically, for example, since the userspecified the term “Equipment” in the query, the “MobileEquip” piece ofdata will wind up being ranked higher than the “Coburg” piece of data,unlike the case where the user simply provided the query “MobileEquip inCoburg,” in which case they would be tied. For pieces of data havingonly a single matching attribute, those pieces of data may be assigned amatch frequency score of 0.

Then, for every node in the graph, a ranking score may then becalculated. The ranking score is based on the fuzzy match score andmatch frequency score for each node (which will both be 0 fornon-matching nodes) and also based on the fuzzy match score and matchfrequency score for every matching node in the graph, scaled by thedistance between the node and the corresponding matching node along theshortest path through the graph. In some example embodiments, a scalingfactor such as a square root may be applied to the distance. As such,matching nodes that are close to the node have more weight towards thenode's score than matching nodes that are further away, along theshortest path.

The reason the shortest path is used is that the graph can be cyclical,and thus there can be multiple paths from one node to another node inthe graph.

An example will be presented in the context of the flat data 300 of FIG.3 and the graph structure 400 of FIG. 4. If the search query isEquipment MobileEquip in Coburg, then matches include Equipment nodes402A, 402C, and 402G and Location node 402B. Each of these matches isassigned a fuzzy match score. Here, for example, the fuzzy match scorefor node 402A would be higher than that for either node 402C or 402Gbecause it more exactly matches the spelling in the query. For each ofthese matching nodes 402A, 402B 402C, 402G, a match frequency score isassigned if the node matches for multiple possible matching attributes.Here, for example, nodes 402A, 402C, and 402G all would be assignedmatch frequency scores because they match based both on the term“equipment,” which matches the attribute “type name,” and on theirnames, which match, at least closely enough, the term “MobileEquip.”

In some example embodiments, at this stage another table called a “whyfound” table 704 can also be populated. The why found table 704 stores,for each node, the reasons why the node has been matched. At this stage,for example, node 402B has been matched solely due to its location nameattribute matching a term in the search query. As such, the why foundtable 704 may store “location name attribute” as the “why found” for theCoburg node 402B. Likewise, each of nodes 402A, 402C and 402G arematched for multiple reasons, firstly because they match on their types(equipment) and secondly because they match on their names. Thus, typeand name may both be added to the why found table 704 entry for each ofnodes 402A, 402C, and 402G. The use of the why found table 704 will bedescribed in more detail later.

Then a ranking score is assigned to every node 402A-402H. For each ofthese nodes 402A-402H, the tanking score is based on the combination offuzzy match score and match frequency scores for itself (if applicable),as well as the combinations of fuzzy match scores and match frequencyscores for each matching node, weighted by distance along the shortestpath. Thus, if one assumes that node 402A has a fuzzy match score of 0.5and a match frequency score of 0.2, node 402C has a fuzzy match score of0.4 and a match frequency score of 0.2, node 402G has a fuzzy matchscore of 0.37 and a match frequency score of 0.2, and node 402B has afuzzy match score of 0.5 and no match frequency score, then the rankingscore assigned to, for example, node 402B will be based on thecombination of these scores, with the fuzzy score for node 402B weightedthe highest, the scores for nodes 402A and 402C weighted the nexthighest (distance of 1 from node 402B) and the scores for node 402Gweighted the least (distance of 3 from node 402B).

Likewise, the ranking score for a non-matching node like 402F will bebased on the combination of the above scores, with the scores for nodes402A and 402G weighted the highest (distance of 1 from node 402F), thefuzzy score for node 402B weighted the next highest (distance of 2 fromnode 402F) and the scores for node 402C weighted the least (distance of3 from node 402F).

Once all of the nodes 402A-402H have been assigned a ranking score, theranking scores may be compared with a threshold that may indicatewhether the corresponding node 402A-402H should be returned as a result.This may be performed by the threshold comparer 706, which eliminatesfrom the search results any potential search result having a rankingscore that does not exceed the threshold. For example, the ranking scorefor Hamburg 402H might be so low that it is not returned as a result.The nodes 402A-402H with ranking scores that exceed this threshold,however, can be sorted according to their ranking scores by a searchresult sorter 708 and returned, in sorted form, as results.

FIG. 8 is a flow diagram illustrating a method 800 for searching data ina database in accordance with an example embodiment. At operation 802, agraph structure and flat data corresponding to the graph structure maybe obtained from a database. At operation 804, a search query isreceived. The search query contains one or more search terms. Atoperation 806, stop words are removed from the one or more search terms.At operation 808, for each of the one or more search terms, the piecesof data from the flat data are searched to locate one or more matchingpieces of data from the flat data. A piece of data from the flat datamatches if it contains at least one attribute with a value similar tothe search term.

A loop is then begun for each matching piece of data from the flat data.At operation 810, a fuzzy match score is calculated for the piece ofdata. The fuzzy match score indicates how similar the at least oneattribute in the matching piece of data is to the corresponding searchterm. At operation 812, a match frequency score is calculated. The matchfrequency score indicates how many attributes in the matching piece ofdata are similar to the corresponding search term. At operation 814, itis determined if there are any additional matching pieces of data. Ifso, the method 800 loops back to operation 810 for the next matchingpiece of data. If not, a loop is begun for each node in the graphstructure. At operation 816, a ranking score is calculated for the nodebased on a combination of the fuzzy match score and the match frequencyscore for a corresponding piece of data from the flat data, if such afuzzy match score and match frequency score exist for the correspondingpiece of data from the flat data, as well as based on combinations offuzzy match scores and match frequency scores for all matching pieces ofdata in the flat data, weighted based on distance along a shortestpossible path between the node and a node corresponding to thecorresponding matching piece of data in the flat data. At operation 818it is determined if there are any more nodes in the graph structure. Ifso, then the method 800 loops back to operation 816 for the next node inthe graph structure. If not, then at operation 820 one or more searchresults are returned based on the ranking scores of nodes correspondingto pieces of data for the one or more search results.

FIG. 9 is a screen capture illustrating a user interface 900 for searchqueries and results in accordance with an example embodiment. Here, userinterface 900 includes a text box 902 where the user has typed thesearch term “MobileEquip in Coburg.” A results area 904 presents sortedsearch results obtained using the search process described earlier.

FIG. 10 is a screen capture illustrating another search entered into theuser interface 900 for search queries and results in accordance with anexample embodiment. Here, the user has typed “equipment MobileEquip inCoburg”, which is a slight modification of the search in FIG. 9. As canbe seen, this causes a change to the ordering of the search results inthe results area 904. Specifically, since the addition of the termequipment to the search query causes equipment nodes matching“MobileEquip” to have two matching attributes rather than one,specifically matching on the type name “equipment” and the name“MobileEquip”, those results are now ranked higher than the results formatches to “Coburg.”

While the above search results are customer-specific, in ERP thecustomer is typically an organization such as a business, sometimes alarge business. The person conducting the search could have one of manydifferent roles in the organization, such as a purchasing manager or asales manager. The searches themselves, therefore, may have differentmeanings for the different roles. In an example embodiment, this issuemay be addressed in a number of ways. Context-based ranking may be used.Specifically, a context-based ranker 710 may utilize anchor points tocome up with a context-based ranking of search results. One anchor isthe type and the other anchor is the attribute. For example, a user mayperform the search “sales order pump”. Here, sales order is the type andpump is the attribute. In an example embodiment, both these anchors aresaved. Then, if the user later searches “MobileEquip,” the system willbe able to identify that even though the type is not specified in thisquery, since “MobileEquip” is an attribute of an anchored type (salesorder), the user may have been wishing to search for a sales orderrelated to “MobileEquip” as opposed to other types of data, such as apurchase contract. The ranking score of the nodes in the graph structure400 may then be dynamically modified to factor in this bias towardspreviously anchored searches. This may be known as context-basedranking.

In an example embodiment, not only the anchors from the queries but alsothe search results from the queries are saved. Specifically, the IDs ofthe pieces of data returned as search results are saved (the resultsthemselves need not be persisted). A matrix may be created with users onone axis and search terms on the other, with the entries in the matrixindicating the number of times the corresponding search terms weresearched. The users may be grouped into groups with users who performedsimilar searches. When a new query is received from a user, it may becompared to searches from users in the same group as the searching user.Clusters of frequently searched terms among different user groups may beidentified. For example, the system may determine that a first group ofusers typically searches for sales orders when searching for the term“pump”, but another group of users typically searches for purchasingcontracts when searching for the term “pump.” This may be known ashistory-based ranking. A history-based ranker 712 may then use theseclusters to provide rankings of the search results based on history.This information can then be used to dynamically alter the rankings ofthe search results provided by the ranking scores.

In one example embodiment, the above context- and history-based rankingapproaches are combined and used to break ties in the ranking scores.Thus, if a first node has a higher-ranking score than a second node, thefirst node will still be ranked higher even after context- andhistory-based ranking approaches are used, but if the second node andthe third node have the same ranking score (which can commonly occur inERP systems), then it is possible that the third node could be re-rankedto be displayed higher than the second node. (In this example, thesystem may by default display results corresponding to nodes having tiedranking scores in the order in which they are found using the searchalgorithm, resulting in the second node ordinarily being displayedhigher than the third node in the results, until the context- andhistory-based ranking approaches are applied to break the tie.)

Since the context- and history-based ranking approached can be applieddynamically, in some systems it may be beneficial for some or all of thecontext- and history-based ranking to be applied after the initialresults have been, or while they are being, displayed. This isespecially useful in systems where the context- and history-basedranking algorithms would potentially slow down the delivery of resultsdue to them taking a noticeable amount of time longer than merely thesearch algorithm described earlier.

Thus, in some example embodiments, the results of the earlier-describedsearch algorithm are displayed and then those results are dynamicallyshifted on the display as the context- and/or history-based rankingalgorithms are applied. For example, the earlier described searchalgorithm on graph structure 400 may return the result corresponding tothe following nodes, in this order: MobileEquip 402A, MobileEquip 402C,MobileEquips 402G Coburg. 402B. Thus, these results may appear to theuser in that order. However, assume that the ranking scores forMobileEquip 402C and MobileEquips 402G were equal and the context-and/or history-based approaches reveal that MobileEquips 402G should beranked higher than MobilEquip 402C due to a higher frequency of searcheson MobileEquips 402G by users in the same user group as the searchinguser. As such, the display may alter the displayed results so that theresult for MobileEquips 402G is swapped with the result for MobilEquip402C. The user may see the initial ranking first, and then see theinitial ranking be altered to the final ranking. This alteration maycontinue through all the results until the context- and/or history-basedapproaches have been fully applied.

FIG. 11 is a flow diagram illustrating a method 1100 for context-basedranking of search results in accordance with an example embodiment. Atoperation 1102, a graph structure and flat data corresponding to thegraph structure are obtained from a database. At operation 1104, asearch query is received from a first user. The search query containsone or more search terms. At operation 1106, a search for resultsrelevant to search query is performed using a first search process. Thefirst search process uses the graph structure and flat datacorresponding to the graph structure to rank search results according toa first ranking order.

At operation 1108, anchor points in prior search queries from the firstuser are identified. Each anchor point is a data type or attribute namefrom the flat data. At operation 1110, the first ranking order isdynamically altered to a second ranking order based on the identifiedanchor points in prior search queries from the first user and frequencyof appearance of the identified anchor points in prior search queriesfrom the first user.

FIG. 12 is a flow diagram illustrating a method 1200 for history-basedranking of search results in accordance with an example embodiment.

At operation 1202, a graph structure and flat data corresponding to thegraph structure are obtained from a database. At operation 1204, asearch query is received from a first user. The search query containsone or more search terms. At operation 1206, a search for resultsrelevant to search query is performed using a first search process. Thefirst search process uses the graph structure and flat datacorresponding to the graph structure to rank search results according toa first ranking order.

At operation 1208, the user is grouped into a group of users whoperformed similar prior search queries. A t operation 1210,identifications of search results returned for the similar prior searchqueries for the group of users are retrieved. At operation 1212, similarclasses in search results are identified using the identifications. Atoperation 1214, the first ranking order is dynamically altered to asecond ranking order based on the identified similar classes.

In the context of the system 100 of FIG. 1, the search engine back-end118 may push the results from the initial search from, for example, themethod 800 of FIG. 8 to the search engine front-end 120. The userinterface 122 may display these results on the user device 124. Then,the search engine back-end 118 can calculate the context-based algorithmresults from, for example, the method 1100 of FIG. 11, and may push theresults of this to the search engine front-end 120. The user interface122 can move one or more of the displayed results based on theseresults. Then the search engine back-end 118 can calculate thehistory-based algorithm results from, for example, the method 1200 ofFIG. 12, and may push the results of this to the search engine front-end120. The user interface 122 can move one or more of the displayedresults based on these results. The result is that the user's experienceis dynamically updated with more and more relevant rankings for theresults while not requiring a significant amount of time for the user tosee initial results.

FIG. 13 is a flow diagram illustrating a method 1300 for dynamicrendering of search results, in accordance with an example embodiment.At operation 1302, a graph structure and flat data corresponding to thegraph structure are obtained from a database. At operation 1304, asearch query is received from a first user. The search query containsone or more search terms. At operation 1306, a search for resultsrelevant to search query is performed using a first search process. Thefirst search process uses the graph structure and flat datacorresponding to the graph structure to rank search results according toa first ranking order.

At operation 1308, one or more search results are returned to the userinterface in the first ranking order for display.

At operation 1310, the first ranking order is dynamically modified to asecond ranking order based on a context-based search. At operation 1312,the second ranking order is transmitted to a user interface todynamically alter display of one or more search results to match thesecond ranking order.

At operation 1314, the second ranking order is dynamically modified to athird ranking order based on a history-based search. At operation 1316,the third ranking order is transmitted to the user interface todynamically alter display of the one or more search results to match thethird ranking order.

Structured Query Language (SQL) is a computer language commonly used tomanage data held in relational databases. While the above-processesdiscuss flattening at least some of the data from relational tables intoflat data, there still are some circumstances where it would bebeneficial to search on the original relational data. For example,individual sensor measurements may still be stored in relational formand not flattened, and therefore searches on sensor measurements, suchas looking for data results where a particular equipment had atemperature in a certain range. Additionally, there are circumstanceswhere the user may wish to modify the data in some way, such as bycreating data, editing values of existing data, or deleting existingdata. In some example embodiments, an additional component may be addedto the search engine back-end 118 in order to handle these situations.This additional component may be called a SQL command former.

FIG. 14 is a block diagram illustrating a SQL command former 1400 inaccordance with an example embodiment. In an example embodiment, asearch query analyzer 1402 may analyze a search query. For ease ofdescription, this user input will be described as a search query,although it is not necessary that the user input actually request data,as it is possible that this “search query” could instead express adesire to modify the relational data.

The search query is analyzed by the search query analyzer 1402. Firstthe query is tokenized. In natural language processing (NLP), there isthe concept of stop words. These are words without too much meaning,such as articles and prepositions (a, an, of, etc.). A stop worddictionary may be used to identify the stop words in the query.Specifically, each token is compared, individually and in variouscombinations of tokens, to the stop word dictionary, and identified stopwords can be deleted from the query. For example, if the query is“Equipment MobileEquip in Coburg”, the individual tokens “Equipment,”“MobileEquip,” “in,” and “Coburg” may be compared to a stop worddictionary, which may identify “in” as being a stop word.

In the ERP realm, however, some traditional stop words have meaning. Forexample, in some chemical formulas, the term “of⇄ surrounded by otherwords implies a certain important aspect of the formula. Merely deletingthe term “of” from a search query blindly might result in incorrect NLPof the query in such circumstances.

In order to remedy this, in an example embodiment, all indexed data fora customer is added to a customer-specific dictionary. When an inputquery is tokenized, in addition to comparing the individual tokens toterms in the stop word dictionary, all the combinations of neighboringwords are compared to the customer-specific dictionary. For instance, inthe above example, the combinations of neighboring tokens will be“Equipment MobileEquip.” “Equipment MobileEquip in,” “EquipmentMobileEquip in Coburg,” “MobileEquip in,” MobileEquip in Coburg,” and“in Coburg.” Each of these combinations may be compared with phrases inthe customer-specific dictionary. For any token in the query that isidentified as a stop word, it is determined if that token is containedin some combination of tokens that appears in the customer-specificdictionary. If so, then the token that is identified as a stop word isnot deleted from the query. Otherwise, it may be deleted from the query.

Thus, in the above example, if either of the token combinations“Equipment MobileEquip in Coburg,” “MobileEquip in,” MobileEquip inCoburg,” or “in Coburg” appear in the customer-specific dictionary, thenthe token “in” is not deleted from the query, even if “in” is a stopword identified in the stop word dictionary. If none of these tokencombinations, however, appears in the customer-specific dictionary, thenthe token “in” is deleted from the query if it is identified in the stopword dictionary.

The tokens may then be searched on the flat data 300 and graph structure400, as described earlier. Specifically, all the nodes in the graphstructure 400 are assigned a ranking score. Eventually, in order tocreate a SQL command based on the input query, views will be created byperforming joins on various pieces of the flat data 300. However,performing joins on all the various combinations of the pieces of flatdata 300 would be too processor-intensive in most applications. Whilethe second threshold described above may help limit returned results tojust results having high ranking scores, in some instances this mightstill be too many results. As such, in an example embodiment, a thirdthreshold is used. This third threshold is not score-based but isinstead quantity-of-results based. For example, the third threshold maybe set at 1000 results. As such, only up to the top 1000 search results(based on corresponding ranking scores) will be joined.

Therefore, at this stage, results are first obtained from the flat data300 and graph structure 400 using the search and ranking algorithmdescribed above with respect to FIG. 8. These results are sorted basedon ranking score. All but the top X of these results are discarded by athreshold evaluator 1404, where X is the third threshold.

Using the remaining results, the why found table 704 described earlier(FIG. 7) is accessed by a why found table analyzer 1406 to identify, foreach of the remaining results, a target piece of data. For anyparticular source piece of data (search result), the target piece ofdata may be the piece of data corresponding to the attribute identifiedin the why found table 704. For example, if the search algorithmidentified that an Equipment MobileEquip node was matched due to itsunderlying data containing both a type name of Equipment and a name ofMobileEquip, then the why found table 704 would contain one rowidentifying the source piece of data (the data corresponding to the nodeEquipment MobileEquip) and the first why found (type name), and anotherrow identifying the source piece of data (the data corresponding to thenode Equipment MobileEquip) and the second why found (name). Thisinformation is then used by a join component 1408 when joining allpieces of data for nodes in the top X search results.

All of these joint pieces of data may be called “views,” orcollectively, a “view.”

The view/views tell the system what needs to be the target(s) of theeventual SQL command, but does not tell the system what needs to be thecommands, modifiers, and operators included in that SQL command. For theoperators, an operator database may be used. The operator databasecontains common query operators with mappings to their corresponding SQLoperators. In many instances, the query operator will be the same as thecorresponding SQL operator, such as for the “>” operator, which means“greater than.” If a user types “>” in a query, then when this query isturned into a SQL command “>” and will also be used. In this case, theoperator database was mainly used to identify the “>” in the query as adatabase (differentiated from other parts of the query). In someinstances, there may be multiple query operators that map to the sameSQL operator. For example, there may be a separate operator databaseentry for “greater than” in the query, which also maps to the “>” SQLoperator, which allows the user to type either “>” or “greater than” inthe query and obtain the same result.

The operator database may be used along with a pattern database. Thepattern database includes patterns of data types and operators and howthey translate into SQL commands. In some example embodiments, theoperator database and the pattern database may actually be combined andaccessed as a single database, accessed by an operator and patterndatabase accessor 1410. For example, rather than searching for anindividual operator such as “>”, the search on this combined operatorand pattern database would be on the operator and the data typessurrounding the operator. So if in the query the “>” is followed by ameasurement, then the search would be for “>[measurement]” in theoperator and pattern database. If the query >is followed by a date, thenthe search would be for “>[date]” in the operator and pattern database.

Since as described earlier the type of each piece of data is classifiedat indexing time, these types are known. Thus, for example, the systemwould know that 10 is a measurement and 10/5/15 is a date. This typingcan actually vary from customer to customer since, as described earlier,the classification at indexing time is on a customer-by-customer basis.Thus, for one customer 10 is a measurement while for another customer 10is a currency value.

The result is that the pattern database (or possibly a combined operatorand pattern database) can provide a SQL pattern of commands, modifiers,and operators. These can be combined with the view(s) determined earlierto form a SQL command. This may be performed using a SQL command creator1412, which combines the view(s) from the join component 1408 and theSQL pattern from the operator and pattern database accessor 1410.

Thus take, for example, the user query “Equipment MobileEquip withpressure>10”: “with” may be determined to be a stop word, “>” anoperator, and “10” a data type. The remaining terms, “Equipment”,“MobileEquip”, and “pressure”, may be tokenized and their variousneighboring permutations searched on the flat data 300 and graphstructure 400. The results from this search may be ranked and all butthe top X results discarded. The remaining results may then be joinedbased on the why found table 704 with target pieces of data in the flatdata 300 to form the view. The operator and pattern database accessor1410 may identify that “with [search term]>[measurement]” should betranslated to the SQL command “select from [view] where[attribute]>[measurement.]”, thus the final SQL command “select fromview where pressure>10” can be formed.

It should be noted that this SQL command formation from a search “query”may be performed not only on searches for data, but also on commands tomodify, delete, or add data. The user may be able to type, for example,“delete Equipment MobileEquip with pressure>10” and the SQL command willbe “delete from view where pressure>10.” This SQL command is still knownas a SQL query even though it is performing a modification instead of apure read, and likewise the initial query the user types to form thisdelete command can also be known as a query. Thus, the system isflexible to perform all sorts of different types of SQL commands usingfreeform input by the user and the techniques described above.

FIG. 15 is a flow diagram illustrating a method 1500 of forming a SQLquery from a freeform search query in accordance with an exampleembodiment. At operation 1502, a freeform search query having one ormore search terms is obtained. At operation 1504, one or more tokens areidentified in the freeform search query. Each token corresponds to asearch term or combination of neighboring search terms in the freeformsearch query.

At operation 1506, a graph structure and flat data corresponding to thegraph structure are obtained from a database. At operation 1508, asearch for results relevant to the identified one or more tokens isperformed using a first search process. The first search process usesthe graph structure and flat data corresponding to the graph structureto rank search results according to a first ranking order. The firstsearch process additionally populates a why found table (e.g., the whyfound table 704) indicating one or more reasons why each search resultwas found.

At operation 1510, pieces of data corresponding to the results relevantto the identified one or more tokens are joined using the why foundtable, forming a view. At operation 1512, one or more operators areidentified in the freeform search query. At operation 1514, one or morepatterns of operators and terms are identified, in a pattern database,matching the one or more operators and one or more surrounding terms inthe freeform search query. At operation 1516, based on the located oneor more patterns and the view, a SQL command is created corresponding tothe freeform search query. At operation 1518, the SQL command is issuedto a relational database.

EXAMPLES Example 1

A system comprising:

at least one hardware processor; and

a computer-readable medium storing instructions that, when executed bythe at least one hardware processor, cause the at least one hardwareprocessor to perform operations comprising:

obtaining, from a database, a graph structure and flat datacorresponding to the graph structure, the graph structure containing aplurality of nodes, each node corresponding to a data type of the flatdata and corresponding to one or more pieces of data in the flat data ofthe corresponding data type, the graph structure further containing aplurality of edges connecting one or more of the plurality of nodes,each edge corresponding to a link between an attribute of a node at oneside of the edge and an attribute of a node at another side of the edge;

receiving a search query, the search query containing one or more searchterms;

removing stop words from the one or more search terms to obtain modifiedsearch terms;

for each of the modified search terms, searching the pieces of data fromthe flat data to locate one or more matching pieces of data from theflat data, wherein a piece of data from the flat data matches if itcontains at least one attribute with a value that is similar to themodified search term;

for each matching piece of data from the flat data:

calculating a fuzzy match score, wherein the fuzzy match score indicateshow similar the at least one attribute in the matching piece of data isto the corresponding search term; and

calculating a match frequency score, wherein the match frequency scoreindicating how many attributes in the matching piece of data are similarto the corresponding search term;

for each node in the graph structure, calculating a ranking score basedon a combination of the fuzzy match score and the match frequency scorefor a corresponding piece of data from the flat data, if such a fuzzymatch score and match frequency score exist for the corresponding pieceof data from the flat data, as well as based on combinations of fuzzymatch scores and match frequency scores for all matching pieces of datain the flat data, weighted based on distance along a shortest possiblepath between the node and a node corresponding to the correspondingmatching piece of data in the flat data; and

returning one or more search results based on the ranking scores ofnodes corresponding to pieces of data for the one or more searchresults.

Example 2

The system of Example 1, wherein an attribute value is consideredsimilar to a search term if the attribute value is within apredetermined edit distance from the search term.

Example 3

The system of Examples 1 or 2, wherein the operations further comprisesorting the one or more search results based on the ranking scores.

Example 4

The system of any of Examples 1-3, wherein the searching the pieces ofdata from the flat data to locate one or more matching pieces of datafrom the flat data includes populating a why found table, the why foundtable containing, for each match found, an indication of the piece ofdata for which the match was found and an indication of an attributename for a corresponding matching attribute value.

Example 5

The system of any of Examples 1-4, wherein the weighting of thecombinations of fuzzy match scores and match frequency scores for allmatching pieces of data in the flat data is based on the square root ofa distance in the graph structure.

Example 6

The system of any of Examples 21-25, wherein the match frequency scoreis zero if there is only one matching attribute value in thecorresponding piece of data.

Example 7

The system of any of Examples 1-6, wherein the returning includessending the one or more search results to a search engine front-end in auser interface of a user device for display by the user interface on ascreen of the user device.

Example 8

A method comprising:

obtaining, from a database, a graph structure and flat datacorresponding to the graph structure, the graph structure containing aplurality of nodes, each node corresponding to a data type of the flatdata and corresponding to one or more pieces of data in the flat data ofthe corresponding data type, the graph structure further containing aplurality of edges connecting one or more of the plurality of nodes,each edge corresponding to a link between an attribute of a node at oneside of the edge and an attribute of a node at another side of the edge;

receiving a search query, the search query containing one or more searchterms;

removing stop words from the one or more search terms to obtain modifiedsearch terms;

for each of the modified search terms, searching the pieces of data fromthe flat data to locate one or more matching pieces of data from theflat data, wherein a piece of data from the flat data matches if itcontains at least one attribute with a value that is similar to themodified search term;

for each matching piece of data from the flat data:

calculating a fuzzy match score, wherein the fuzzy match score indicateshow similar the at least one attribute in the matching piece of data isto the corresponding search term; and

calculating a match frequency score, wherein the match frequency scoreindicating how many attributes in the matching piece of data are similarto the corresponding search term;

for each node in the graph structure, calculating a ranking score basedon a combination of the fuzzy match score and the match frequency scorefor a corresponding piece of data from the flat data, if such a fuzzymatch score and match frequency score exist for the corresponding pieceof data from the flat data, as well as based on combinations of fuzzymatch scores and match frequency scores for all matching pieces of datain the flat data, weighted based on distance along a shortest possiblepath between the node and a node corresponding to the correspondingmatching piece of data in the flat data; and

returning one or more search results based on the ranking scores ofnodes corresponding to pieces of data for the one or more searchresults.

Example 9

The method of Example 8, wherein an attribute value is consideredsimilar to a search term if the attribute value is within apredetermined edit distance from the search term.

Example 10

The method of Examples 8 or 9, further comprising sorting the one ormore search results based on the ranking scores.

Example 11

The method of any of Examples 8-10, wherein the searching the pieces ofdata from the flat data to locate one or more matching pieces of datafrom the flat data includes populating a why found table, the why foundtable containing, for each match found, an indication of the piece ofdata for which the match was found and an indication of an attributename for a corresponding matching attribute value.

Example 12

The method of any of Examples 8-11, wherein the weighting of thecombinations of fuzzy match scores and match frequency scores for allmatching pieces of data in the flat data is based on the square root ofa distance in the graph structure.

Example 13

The method of any of Examples 8-12, wherein the match frequency score iszero if there is only one matching attribute value in the correspondingpiece of data.

Example 14

The method of any of Examples 8-13, wherein the returning includessending the one or more search results to a search engine front-end in auser interface of a user device for display by the user interface on ascreen of the user device.

Example 15

A non-transitory machine-readable storage medium comprising instructionsthat, when implemented by one or more machines, cause the one or moremachines to perform operations comprising:

obtaining, from a database, a graph structure and flat datacorresponding to the graph structure, the graph structure containing aplurality of nodes, each node corresponding to a data type of the flatdata and corresponding to one or more pieces of data in the flat data ofthe corresponding data type, the graph structure further containing aplurality of edges connecting one or more of the plurality of nodes,each edge corresponding to a link between an attribute of a node at oneside of the edge and an attribute of a node at another side of the edge;

receiving a search query, the search query containing one or more searchterms;

removing stop words from the one or more search terms to obtain modifiedsearch terms;

for each of the modified search terms, searching the pieces of data fromthe flat data to locate one or more matching pieces of data from theflat data, wherein a piece of data from the flat data matches if itcontains at least one attribute with a value that is similar to themodified search term;

for each matching piece of data from the flat data:

calculating a fuzzy match score, wherein the fuzzy match score indicateshow similar the at least one attribute in the matching piece of data isto the corresponding search term; and

calculating a match frequency score, wherein the match frequency scoreindicating how many attributes in the matching piece of data are similarto the corresponding search term;

for each node in the graph structure, calculating a ranking score basedon a combination of the fuzzy match score and the match frequency scorefor a corresponding piece of data from the flat data, if such a fuzzymatch score and match frequency score exist for the corresponding pieceof data from the flat data, as well as based on combinations of fuzzymatch scores and match frequency scores for all matching pieces of datain the flat data, weighted based on distance along a shortest possiblepath between the node and a node corresponding to the correspondingmatching piece of data in the flat data; and

returning one or more search results based on the ranking scores ofnodes corresponding to pieces of data for the one or more searchresults.

Example 16

The non-transitory machine-readable storage medium of Example 15,wherein an attribute value is considered similar to a search term if theattribute value is within a predetermined edit distance from the searchterm.

Example 17

The non-transitory machine-readable storage medium of Example 15 or 16,wherein the operations further comprise sorting the one or more searchresults based on the ranking scores.

Example 18

The non-transitory machine-readable storage medium of any of Examples15-17, wherein the searching the pieces of data from the flat data tolocate one or more matching pieces of data from the flat data includespopulating a why found table, the why found table containing, for eachmatch found, an indication of the piece of data for which the match wasfound and an indication of an attribute name for a correspondingmatching attribute value.

Example 19

The non-transitory machine-readable storage medium of any of Examples15-18, wherein the weighting of the combinations of fuzzy match scoresand match frequency scores for all matching pieces of data in the flatdata is based on the square root of a distance in the graph structure.

Example 20

The non-transitory machine-readable storage medium of any of Examples15-19, wherein the match frequency score is zero if there is only onematching attribute value in the corresponding piece of data.

FIG. 16 is a block diagram 1600 illustrating an architecture of software1602, which can be installed on any one or more of the devices describedabove. FIG. 16 is merely a non-limiting example of a softwarearchitecture, and it will be appreciated that many other architecturescan be implemented to facilitate the functionality described herein. Invarious embodiments, the software 1602 is implemented by hardware suchas a machine 1700 of FIG. 17 that includes processors 1710, memory 1730,and input/output (I/O) components 1750. In this example architecture,the software 1602 can be conceptualized as a stack of layers where eachlayer may provide a particular functionality. For example, the software1602 includes layers such as an operating system 1604, libraries 1606,frameworks 1608, and applications 1610. Operationally, the applications1610 invoke API calls 1612 through the software stack and receivemessages 1614 in response to the API calls 1612, consistent with someembodiments.

In various implementations, the operating system 1604 manages hardwareresources and provides common services. The operating system 1604includes, for example, a kernel 1620, services 1622, and drivers 1624.The kernel 1620 acts as an abstraction layer between the hardware andthe other software layers, consistent with some embodiments. Forexample, the kernel 1620 provides memory management, processormanagement (e.g., scheduling), component management, networking, andsecurity settings, among other functionality. The services 1622 canprovide other common services for the other software layers. The drivers1624 are responsible for controlling or interfacing with the underlyinghardware, according to some embodiments. For instance, the drivers 1624can include display drivers, camera drivers, BLUETOOTH® or BLUETOOTH®Low-Energy drivers, flash memory drivers, serial communication drivers(e.g., Universal Serial Bus (USB) drivers), Wi-Fi® drivers, audiodrivers, power management drivers, and so forth.

In some embodiments, the libraries 1606 provide a low-level commoninfrastructure utilized by the applications 1610. The libraries 1606 caninclude system libraries 1630 (e.g., C standard library) that canprovide functions such as memory allocation functions, stringmanipulation functions, mathematic functions, and the like. In addition,the libraries 1606 can include API libraries 1632 such as medialibraries (e.g., libraries to support presentation and manipulation ofvarious media formats such as Moving Picture Experts Group-4 (MPEG4),Advanced Video Coding (H.264 or AVC), Moving Picture Experts GroupLayer-3 (MP3), Advanced Audio Coding (AAC), Adaptive Multi-Rate (AMR)audio codec, Joint Photographic Experts Group (JPEG or JPG), or PortableNetwork Graphics (PNG)), graphics libraries (e.g., an OpenGL frameworkused to render in 2D and 3D in a graphic context on a display), databaselibraries (e.g., SQLite to provide various relational databasefunctions), web libraries (e.g., WebKit to provide web browsingfunctionality), and the like. The libraries 1606 can also include a widevariety of other libraries 1634 to provide many other APIs to theapplications 1610.

The frameworks 1608 provide a high-level common infrastructure that canbe utilized by the applications 1610, according to some embodiments. Forexample, the frameworks 1608 provide various graphic user interface(GUI) functions, high-level resource management, high-level locationservices, and so forth. The frameworks 1608 can provide a broad spectrumof other APIs that can be utilized by the applications 1610, some ofwhich may be specific to a particular operating system or platform.

In an example embodiment, the applications 1610 include a homeapplication 1650, a contacts application 1652, a browser application1654, a book reader application 1656, a location application 1658, amedia application 1660, a messaging application 1662, a game application1664, and a broad assortment of other applications, such as athird-party application 1666. According to some embodiments, theapplications 1610 are programs that execute functions defined in theprograms. Various programming languages can be employed to create one ormore of the applications 1610, structured in a variety of manners, suchas object-oriented programming languages (e.g., Objective-C, Java, orC++) or procedural programming languages (e.g., C or assembly language).In a specific example, the third-party application 1666 (e.g., anapplication developed using the ANDROID™ or IOS™ software developmentkit (SDK) by an entity other than the vendor of the particular platform)may be mobile software running on a mobile operating system such asIOS™, ANDROID™, WINDOWS® Phone, or another mobile operating system. Inthis example, the third-party application 1666 can invoke the API calls1612 provided by the operating system 1604 to facilitate functionalitydescribed herein.

FIG. 17 illustrates a diagrammatic representation of a machine 1700 inthe form of a computer system within which a set of instructions may beexecuted for causing the machine 1700 to perform any one or more of themethodologies discussed herein, according to an example embodiment.Specifically, FIG. 17 shows a diagrammatic representation of the machine1700 in the example form of a computer system, within which instructions1716 (e.g., software, a program, an application, an applet, an app, orother executable code) for causing the machine 1700 to perform any oneor more of the methodologies discussed herein may be executed. Forexample, the instructions 1716 may cause the machine 1700 to execute themethod 800 of FIG. 8. Additionally, or alternatively, the instructions1716 may implement FIGS. 1-15, and so forth. The instructions 1716transform the general, non-programmed machine 1700 into a particularmachine 1700 programmed to carry out the described and illustratedfunctions in the manner described. In alternative embodiments, themachine 1700 operates as a standalone device or may be coupled (e.g.,networked) to other machines. In a networked deployment, the machine1700 may operate in the capacity of a server machine or a client machinein a server-client network environment, or as a peer machine in apeer-to-peer (or distributed) network environment. The machine 1700 maycomprise, but not be limited to, a server computer, a client computer, apersonal computer (PC), a tablet computer, a laptop computer, a netbook,a set-top box (STB), a personal digital assistant (PDA), anentertainment media system, a cellular telephone, a smart phone, amobile device, a wearable device (e.g., a smart watch), a smart homedevice (e.g., a smart appliance), other smart devices, a web appliance,a network router, a network switch, a network bridge, or any machinecapable of executing the instructions 1716, sequentially or otherwise,that specify actions to be taken by the machine 1700. Further, whileonly a single machine 1700 is illustrated, the term “machine” shall alsobe taken to include a collection of machines 1700 that individually orjointly execute the instructions 1716 to perform any one or more of themethodologies discussed herein.

The machine 1700 may include processors 1710, memory 1730, and I/Ocomponents 1750, which may be configured to communicate with each othersuch as via a bus 1702. In an example embodiment, the processors 1710(e.g., a Central Processing Unit (CPU), a Reduced Instruction SetComputing (RISC) processor, a Complex Instruction Set Computing (CISC)processor, a Graphics Processing Unit (GPU), a Digital Signal Processor(DSP), an application-specific integrated circuit (ASIC), aRadio-Frequency Integrated Circuit (RFIC), another processor, or anysuitable combination thereof) may include, for example, a processor 1712and a processor 1714 that may execute the instructions 1716. The term“processor” is intended to include multi-core processors that maycomprise two or more independent processors (sometimes referred to as“cores”) that may execute instructions contemporaneously. Although FIG.17 shows multiple processors 1710, the machine 1700 may include a singleprocessor with a single core, a single processor with multiple cores(e.g., a multi-core processor), multiple processors with a single core,multiple processors with multiples cores, or any combination thereof.

The memory 1730 may include a main memory 1732, a static memory 1734,and a storage unit 1736, both accessible to the processors 1710 such asvia the bus 1702. The main memory 1732, the static memory 1734, and thestorage unit 1736 store the instructions 1716 embodying any one or moreof the methodologies or functions described herein. The instructions1716 may also reside, completely or partially, within the main memory1732, within the static memory 1734, within the storage unit 1736,within at least one of the processors 1710 (e.g., within the processor'scache memory), or any suitable combination thereof, during executionthereof by the machine 1700.

The I/O components 1750 may include a wide variety of components toreceive input, provide output, produce output, transmit information,exchange information, capture measurements, and so on. The specific I/Ocomponents 1750 that are included in a particular machine will depend onthe type of machine. For example, portable machines such as mobilephones will likely include a touch input device or other such inputmechanisms, while a headless server machine will likely not include sucha touch input device. It will be appreciated that the I/O components1750 may include many other components that are not shown in FIG. 17.The I/O components 1750 are grouped according to functionality merelyfor simplifying the following discussion, and the grouping is in no waylimiting. In various example embodiments, the I/O components 1750 mayinclude output components 1752 and input components 1754. The outputcomponents 1752 may include visual components (e.g., a display such as aplasma display panel (PDP), a light emitting diode (LED) display, aliquid crystal display (LCD), a projector, or a cathode ray tube (CRT)),acoustic components (e.g., speakers), haptic components (e.g., avibratory motor, resistance mechanisms), other signal generators, and soforth. The input components 1754 may include alphanumeric inputcomponents (e.g., a keyboard, a touch screen configured to receivealphanumeric input, a photo-optical keyboard, or other alphanumericinput components), point-based input components (e.g., a mouse, atouchpad, a trackball, a joystick, a motion sensor, or another pointinginstrument), tactile input components (e.g., a physical button, a touchscreen that provides location and/or force of touches or touch gestures,or other tactile input components), audio input components (e.g., amicrophone), and the like.

In further example embodiments, the I/O components 1750 may includebiometric components 1756, motion components 1758, environmentalcomponents 1760, or position components 1762, among a wide array ofother components. For example, the biometric components 1756 may includecomponents to detect expressions (e.g., hand expressions, facialexpressions, vocal expressions, body gestures, or eye tracking), measurebiosignals (e.g., blood pressure, heart rate, body temperature,perspiration, or brain waves), identify a person (e.g., voiceidentification, retinal identification, facial identification,fingerprint identification, or electroencephalogram-basedidentification), and the like. The motion components 1758 may includeacceleration sensor components (e.g., accelerometer), gravitation sensorcomponents, rotation sensor components (e.g., gyroscope), and so forth.The environmental components 1760 may include, for example, illuminationsensor components (e.g., photometer), temperature sensor components(e.g., one or more thermometers that detect ambient temperature),humidity sensor components, pressure sensor components (e.g.,barometer), acoustic sensor components (e.g., one or more microphonesthat detect background noise), proximity sensor components (e.g.,infrared sensors that detect nearby objects), gas sensors (e.g., gasdetection sensors to detect concentrations of hazardous gases for safetyor to measure pollutants in the atmosphere), or other components thatmay provide indications, measurements, or signals corresponding to asurrounding physical environment. The position components 1762 mayinclude location sensor components (e.g., a Global Positioning System(GPS) receiver component), altitude sensor components (e.g., altimetersor barometers that detect air pressure from which altitude may bederived), orientation sensor components (e.g., magnetometers), and thelike.

Communication may be implemented using a wide variety of technologies.The I/O components 1750 may include communication components 1764operable to couple the machine 1700 to a network 1780 or devices 1770via a coupling 1782 and a coupling 1772, respectively. For example, thecommunication components 1764 may include a network interface componentor another suitable device to interface with the network 1780. Infurther examples, the communication components 1764 may include wiredcommunication components, wireless communication components, cellularcommunication components, Near Field Communication (NFC) components,Bluetooth® components (e.g., Bluetooth® Low Energy), WiFi® components,and other communication components to provide communication via othermodalities. The devices 1770 may be another machine or any of a widevariety of peripheral devices (e.g., coupled via a USB).

Moreover, the communication components 1764 may detect identifiers orinclude components operable to detect identifiers. For example, thecommunication components 1764 may include RFID tag reader components,NFC smart tag detection components, optical reader components (e.g., anoptical sensor to detect one-dimensional bar codes such as UniversalProduct Code (UPC) bar code, multi-dimensional bar codes such as QRcode, Aztec code, Data Matrix, Dataglyph, MaxiCode, PDF417, Ultra Code,UCC RSS-2D bar code, and other optical codes), or acoustic detectioncomponents (e.g., microphones to identify tagged audio signals). Inaddition, a variety of information may be derived via the communicationcomponents 1764, such as location via Internet Protocol (IP)geolocation, location via Wi-Fi® signal triangulation, location viadetecting an NFC beacon signal that may indicate a particular location,and so forth.

The various memories (i.e., 1730, 1732, 1734, and/or memory of theprocessor(s) 1710) and/or the storage unit 1736 may store one or moresets of instructions and data structures (e.g., software) embodying orutilized by any one or more of the methodologies or functions describedherein. These instructions (e.g., the instructions 1716), when executedby the processor(s) 1710, cause various operations to implement thedisclosed embodiments.

As used herein, the terms “machine-storage medium,” “device-storagemedium,” and “computer-storage medium” mean the same thing and may beused interchangeably. The terms refer to a single or multiple storagedevices and/or media (e.g., a centralized or distributed database,and/or associated caches and servers) that store executable instructionsand/or data. The terms shall accordingly be taken to include, but not belimited to, solid-state memories, and optical and magnetic media,including memory internal or external to processors. Specific examplesof machine-storage media, computer-storage media, and/or device-storagemedia include non-volatile memory, including by way of examplesemiconductor memory devices, e.g., erasable programmable read-onlymemory (EPROM), electrically erasable programmable read-only memory(EEPROM), field-programmable gate array (FPGA), and flash memorydevices; magnetic disks such as internal hard disks and removable disks;magneto-optical disks; and CD-ROM and DVD-ROM disks. The terms“machine-storage media,” “computer-storage media,” and “device-storagemedia” specifically exclude carrier waves, modulated data signals, andother such media, at least some of which are covered under the term“signal medium” discussed below.

In various example embodiments, one or more portions of the network 1780may be an ad hoc network, an intranet, an extranet, a virtual privatenetwork (VPN), a local-area network (LAN), a wireless LAN (WLAN), awide-area network (WAN), a wireless WAN (WWAN), a metropolitan-areanetwork (MAN), the Internet, a portion of the Internet, a portion of thepublic switched telephone network (PSTN), a plain old telephone service(POTS) network, a cellular telephone network, a wireless network, aWi-Fi® network, another type of network, or a combination of two or moresuch networks. For example, the network 1780 or a portion of the network1780 may include a wireless or cellular network, and the coupling 1782may be a Code Division Multiple Access (CDMA) connection, a GlobalSystem for Mobile communications (GSM) connection, or another type ofcellular or wireless coupling. In this example, the coupling 1782 mayimplement any of a variety of types of data transfer technology, such asSingle Carrier Radio Transmission Technology (1xRTT), Evolution-DataOptimized (EVDO) technology, General Packet Radio Service (GPRS)technology, Enhanced Data rates for GSM Evolution (EDGE) technology,third Generation Partnership Project (3GPP) including 3G, fourthgeneration wireless (4G) networks, Universal Mobile TelecommunicationsSystem (UMTS), High-Speed Packet Access (HSPA), WorldwideInteroperability for Microwave Access (WiMAX), Long-Term Evolution (LTE)standard, others defined by various standard-setting organizations,other long-range protocols, or other data transfer technology.

The instructions 1716 may be transmitted or received over the network1780 using a transmission medium via a network interface device (e.g., anetwork interface component included in the communication components1764) and utilizing any one of a number of well-known transfer protocols(e.g., HTTP). Similarly, the instructions 1716 may be transmitted orreceived using a transmission medium via the coupling 1772 (e.g., apeer-to-peer coupling) to the devices 1770. The terms “transmissionmedium” and “signal medium” mean the same thing and may be usedinterchangeably in this disclosure. The terms “transmission medium” and“signal medium” shall be taken to include any intangible medium that iscapable of storing, encoding, or carrying the instructions 1716 forexecution by the machine 1700, and include digital or analogcommunications signals or other intangible media to facilitatecommunication of such software. Hence, the terms “transmission medium”and “signal medium” shall be taken to include any form of modulated datasignal, carrier wave, and so forth. The term “modulated data signal”means a signal that has one or more of its characteristics set orchanged in such a manner as to encode information in the signal.

The terms “machine-readable medium,” “computer-readable medium,” and“device-readable medium” mean the same thing and may be usedinterchangeably in this disclosure. The terms are defined to includeboth machine-storage media and transmission media. Thus, the termsinclude both storage devices/media and carrier waves/modulated datasignals.

1. A system comprising: at least one hardware processor, and a computer-readable medium storing instructions that, when executed by the at least one hardware processor, cause the at least one hardware processor to perform operations composing: obtaining, from a database, a graph stiucture and flat data corresponding to the graph structure, the graph structure containing a plurality of nodes, each node corresponding to a data type of the flat data and corresponding to one or more pieces of data in the flat data of the corresponding data type, the graph structure further containing a plurality of edges connecting one or more of the plurality of nodes, each edge corresponding to a link between an attribute of a node at one side of the edge and an attribute of a node at another side of the edge; receiving a search query, the search query containing one or more search terms; removing stop words from the one or more search terms to obtain modified search terms; for each of the modified search terms, searching the pieces of data from the flat data to locate one or more matching pieces of data from the flat data, wherein a piece of data from the flat data matches if it contains at least one attribute with a value that is similar to the modified search term; for each matching piece of data from the flat data: calculating a fuzzy match score, wherein the fuzzy match score indicates how similar the at least one attribute in the matching piece of data is to the corresponding search term; and calculating a match frequency score, wherein the match frequency score indicating how many attributes in the matching piece of data are similar to the corresponding search term; for each node in the graph structure, calculating a ranking score based on a combination of the fuzzy match score and the match frequency score for a corresponding piece of data from the flat data, if such a fuzzy match score and match frequency score exist for the corresponding piece of data from the flat data, as well as based on combinations of fuzzy match scores and match frequency scores for all matching pieces of data in the flat data, weighted based on distance along a shortest possible path between the node and a node corresponding to the corresponding matching piece of data in the flat data; and returning one or more search results based on the ranking scores of nodes corresponding to pieces of data for the one or more search results.
 2. The system of claim 1, wherein an attribute value is considered similar to a search term if the attribute value is within a predetermined edit distance from the search term
 3. The system of claim 1, wherein the operations further comprise sorting the one or more search results based on the ranking scores.
 4. The system of claim 1, wherein the searching tlie pieces of data from the flat data to locate one or more matching pieces of data from the flat data includes populating a why found table, the why found table containing, for each match found, an indication of the piece of data for which the match was found and an indication of an attribute name for a corresponding matching attribute value.
 5. The system of claim 1, wherein the weighting of the combinations of fuzzy match scores and match frequency scores for all matching pieces of data in the flat data is based on the square root of a distance in the graph structure.
 6. The system of claim 1, wherein the match frequency score is zero if there is only one matching attribute value in the corresponding piece of data.
 7. The system of claim 1, wherein the returning includes sending the one or more search results to a search engine front-end in a user interface of a user device for display by the user interface on a screen of the user device.
 8. A method comprising. obtaining, from a database, a graph structure and flat data corresponding to the graph structure, the graph structure containing a plurality of nodes, each node corresponding to a data type of the flat data and corresponding to one or more pieces of data in the flat data of the corresponding data type, the graph structure further containing a plurality of edges connecting one or more of the plurality of nodes, each edge corresponding to a link between an attribute of a node at one side of the edge and an attribute of a node at another side of the edge; receiving a search query , the search query containing one or more search terms; removing stop words from the one or more search terms to obtain modified search terms; for each of the modified search terms, searching the pieces of data from the flat data to locate one or more matching pieces of data from the flat data, wherein a piece of data from the flat data matches if it contains at least one attribute with a value that is similar to the modified search term; for each matching piece of data from the flat data: calculating a fuzzy match score, wherein the fuzzy match score indicates how similar the at least one attribute in the matching piece of data is to the corresponding search term, and calculating a match frequency score, wherein the match frequency score indicating how many attributes in the matching piece of data are similar to the corresponding search term; for each node in the graph structure, calculating a ranking score based on a combination of the fuzzy match score and the match frequency score for a corresponding piece of data from the flat data, if such a fuzzy match score and match frequency score exist for the corresponding piece of data from the fiat data, as well as based on combinations of fuzzy match scores and match frequency scores for all matching pieces of data in the flat data, weighted based on distance along a shortest possible path between the node and a node corresponding to the corresponding matching piece of data in the flat data; and returning one or more search results based on the ranking scores of nodes corresponding to pieces of data for the one or more search results.
 9. The method of claim 8, wherein an attribute value is considered similar to a search term if the attribute value is within a predetermined edit distance from the search term.
 10. The method of claim 8, further comprising stating the one or more search results based on the ranking scores.
 11. The method of claim 8, wherein the searching the pieces of data from the flat data to locate one or more matching pieces of data from the flat data includes populating a why found table, the why found table containing, for each match found, an indication of the piece of data for w hich the match was found and an indication of an attribute name for a corresponding matching attribute value.
 12. The method of claim 8, wherein the weighting of the combinations of fuzzy match scores and match frequency scores for all matching pieces of data in the flat data is based on the square root of a distance in the graph structure.
 13. The method of claim 8, wherein the match frequency score is zero if there is only one matching attribute value in the corresponding piece of data.
 14. The method of claim 8, wherein tire returning includes sending the one or more search results to a search engine front-end in a user interface of a user device for display bv the user interface on a screen of the user device.
 15. A non-transitory machine-readable storage medium comprising instructions that, when implemented by one or more machines, cause the one or more machines to perform operations comprising: obtaining, from a database, a graph structure and flat data corresponding to the graph structure, the graph structure containing a plurality of nodes each node corresponding to a data type of the flat data and corresponding to chic or more pieces of data in the flat data of the corresponding data type, the graph structure further containing a plurality of edges connecting one or more of the plurality of nodes, each edge corresponding to a link between an attribute of a node at one side of the edge and an attribute of a node at another side of the edge; receiving a search query, the search query containing one or more search terms; removing stop words from the one or more search terms to obtain modified search terms; for each of the modified search terms, searching the pieces of data from the flat data to locate one or more matching pieces of data from the flat data, w herein a piece of data from the flat data matches if it contains at least one attribute w ith a value that is similar to the modified search term; for each matching piece of data from the flat data: calculating a fuzzy match score, wherein the fuzzy match score indicates how similar the at least one attribute in the matching piece of data is to the corresponding search term; and calculating a match frequency score, wherein the match frequency score indicating how many attributes in the matching piece of data are similar to the corresponding search term; for each node in the graph structure, calculating a ranking score based on a combination of the fuzzy match score and the match frequency score for a corresponding piece of data from the flat data, if such a fuzzy match score and match frequency score exist for the corresponding piece of data from the flat data, as well as based on combinations of fuzzy match scores and match frequency scores for all matching pieces of data in the flat data, weighted based cm distance along a shortest possible path between the node and a node corresponding to the corresponding matching piece of data in the flat data; and returning one or more search results based on the ranking scores of nodes corresponding to pieces of data for the one or more search results.
 16. The non-transitory machine-readable storage medium of claim 15, wherein an attribute value is considered similar to a search term if the attribute value is within a predetermined edit distance from the search term.
 17. The non-transitory machine-readable storage medium of claim 15, wherein the operations further comprise sorting the one or more search results based on the ranking scores.
 18. The non-transitory machine-readable storage medium of claim 15, wherein the searching the pieces of data from the flat data to locate one or more matching pieces of data from the flat data includes populating a why found table the why found table containing, for each match found, an indication of the piece of data for which the match was found and an indication of an attribute name for a corresponding matching attnbute value.
 19. The non-transitory machine-readable storage medium of claim 15, wherein the weighting of the combinations of fuzzy match scores and match frequency scores for all matching pieces of data in the flat data is based on the square root of a distance in the graph structure.
 20. The non-transitory machinc-readable storage medium of claim 15, wherein the match frequency score is zero if there is only one matching attribute value in the corresponding piece of data. 